Intersection of Random Sets 3

نویسنده

  • Gunnar Taraldsen
چکیده

We prove compact-randomness of the intersection of a measurable familyof compact-random sets. This generalizes results on the intersection of countable families of random sets. The main tools are given by the theory of Souslin spaces and the idea of countable separation. An example of a random set is given by the energy spectrum of an electron in a disordered solid, or more generally by the spectrum of a closed linear random operator. If the solid is ergodic the spectrum equals a xed set. This self-averaging result fails if the electron in addition is innuenced by an electric eld. Our idea is to single out the part of the spectrum which depends on the bulk properties of the solid. The intersection result makes it possible to prove self-averaging for this part of the spectrum. This work indicates the importance of the link between the theory of random sets and the theory of linear random operators.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs

We investigate the existence and efficient algorithmic construction of close to optimal independent sets in random models of intersection graphs. In particular, (a) we propose a new model for random intersection graphs (Gn,m,~ p) which includes the model of [10] (the “uniform” random intersection graphs model) as an important special case. We also define an interesting variation of the model of...

متن کامل

General definitions for the union and intersection of ordered fuzzy multisets

Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...

متن کامل

Constructions of independent sets in random intersection graphs

The considered problem concerns constructing independent sets in a random intersection graph. We concentrate on two cases of the model: a binomial and a uniform random intersection graph. For both models we analyse two greedy algorithms and prove that they find asymptotically almost optimal independent sets. We provide detailed analysis of the presented algorithms and give tight bounds on the i...

متن کامل

INTERSECTION OF ESSENTIAL IDEALS IN THE RING OF REAL-VALUED CONTINUOUS FUNCTIONS ON A FRAME

A frame $L$ is called {it coz-dense} if $Sigma_{coz(alpha)}=emptyset$ implies $alpha=mathbf 0$. Let $mathcal RL$ be the ring of real-valued continuous functions on a coz-dense and completely regular frame $L$. We present a description of the socle of the ring $mathcal RL$ based on minimal ideals of $mathcal RL$ and zero sets in pointfree topology. We show that socle of $mathcal RL$ is an essent...

متن کامل

Degree Distributions in General Random Intersection Graphs

Random intersection graphs, denoted by G(n,m, p), are introduced in [9, 14] as opposed to classical Erdős-Rényi random graphs. Let us consider a set V with n vertices and another universal set W with m elements. Define a bipartite graph B(n,m, p) with independent vertex sets V and W . Edges between v ∈ V and w ∈ W exist independently with probability p. The random intersection graph G(n,m, p) d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995